A Bipartite Graph with Non-Unimodal Independent Set Sequence
نویسندگان
چکیده
We show that the independent set sequence of a bipartite graph need not be unimodal.
منابع مشابه
The independent set sequence of regular bipartite graphs
Let it(G) be the number of independent sets of size t in a graph G. Alavi, Erdős, Malde and Schwenk made the conjecture that if G is a tree then the independent set sequence {it(G)}t≥0 of G is unimodal; Levit and Mandrescu further conjectured that this should hold for all bipartite G. We consider the independent set sequence of finite regular bipartite graphs, and graphs obtained from these by ...
متن کاملTwo problems on independent sets in graphs
Let it(G) denote the number of independent sets of size t in a graph G. Levit and Mandrescu have conjectured that for all bipartite G the sequence (it(G))t≥0 (the independent set sequence of G) is unimodal. We provide evidence for this conjecture by showing that is true for almost all equibipartite graphs. Specifically, we consider the random equibipartite graph G(n, n, p), and show that for an...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملGroups whose Bipartite Divisor Graph for Character Degrees Has Five Vertices
Let $G$ be a finite group and $cd^*(G)$ be the set of nonlinear irreducible character degrees of $G$. Suppose that $rho(G)$ denotes the set of primes dividing some element of $cd^*(G)$. The bipartite divisor graph for the set of character degrees which is denoted by $B(G)$, is a bipartite graph whose vertices are the disjoint union of $rho(G)$ and $cd^*(G)$, and a vertex $p in rho(G)$ is conne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013